Cellular Automata Markov Method, An Approach for Rice Self-Sufficiency Projection
نویسندگان
چکیده
منابع مشابه
A direct projection method for Markov chains
A direct method based on oblique projections is adapted to compute the stationary distribution vector of a finite Markov chain. The algorithm can also be used to compute the group inverse of the corresponding generator matrix. It is shown how to update the stationary vector and other quantities of interest when one row of the transition probability matrix is modified. A GTH-like variant that ap...
متن کاملSelf-replicating Cellular Automata
Abstract In this paper, we present a possible implementation of arithmetic functions (notably, addition and multiplication) using self-replicating cellular automata. The operations are performed by storing a dedicated program (sequence of states) on self-replicating loops, and letting the loops retrieve the operands, exchange data among themselves, and perform the calculations according to a se...
متن کاملPattern Formation of the FitzHugh-Nagumo Model: Cellular Automata Approach
FitzHugh-Nagumo (FHN) model is a famous Reaction-Diffusion System which first introduced for the conduction of electrical impulses along a nerve fiber. This model is also considered as an abstract model for pattern formation. Here, we have used the Cellular Automata method to simulate the pattern formation of the FHN model. It is shown that the pattern of this model is very similar to those...
متن کاملIntegrating cellular automata Markov model to simulate future land use change of a tropical basin
Predicting land use change is an indispensable aspect in identifying the best development and management of land resources and their potential. This study used certified land-use maps of 1997, 2006, and 2015 combined with ancillary data such as road networks, water bodies and slopes, obtained from the Department of Agriculture and the Department of Surveying and Mapping in Malaysia, respectivel...
متن کاملA Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring
All the social networks can be modeled as a graph, where each roles as vertex and each relationroles as an edge. The graph can be show as G = [V;E], where V is the set of vertices and E is theset of edges. All social networks can be segmented to K groups, where there are members in eachgroup with same features. In each group each person knows other individuals and is in touch ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Ecological Engineering
سال: 2019
ISSN: 2299-8993
DOI: 10.12911/22998993/108651